Bilevel Programming Model of Urban Public Transport Network under Fairness Constraints
نویسندگان
چکیده
منابع مشابه
Bilevel Programming with Knapsack Constraints
A special class of bilevel programming problems with discrete para-metric lower level problems is considered. First, necessary and suucient conditions for the existence of optimal solutions are given. Then, a pseu-dopolynomial exact and a polynomial approximate algorithms for solving the bilevel problem are proposed.
متن کاملTourism and urban public transport: Holding demand pressure under supply constraints
Scholars and local planners are becoming increasingly interested in the contribution of tourism to economic and social development. In the European cities that currently lead the world rankings for tourist arrivals, local governments have actively promoted tourism. Mobility is an essential issue for tourists visiting large cities, since it is a crucial factor for their comfort. It also facilita...
متن کاملA New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کاملUrban Public Transport Challenges
This paper focuses on a number of challenges faced by the public transport industry and the prospects for resolution. Many of the issues are often shrouded in ideology, politics and prejudices that typically cloud the real merits of a solution. We argue that public transport is increasingly a niche provider of land passenger transport services, which if positioned and managed better will be cap...
متن کاملEmpirical Risk Minimization under Fairness Constraints
We address the problem of algorithmic fairness: ensuring that sensitive variables do not unfairly influence the outcome of a classifier. We present an approach based on empirical risk minimization, which incorporates a fairness constraint into the learning problem. It encourages the conditional risk of the learned classifier to be approximately constant with respect to the sensitive variable. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2019
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2019/2930502